A Concurrent Semantics for Concurrent Constraint Programs via Contextual Nets

نویسندگان

  • Ugo Montanari
  • Francesca Rossi
چکیده

We propose a concurrent semantics for concurrent constraint (cc) programs. A contextual net, that is a net with context conditions, besides pre-and post-conditions, is associated to each cc program. Context conditions are items which have to be present in order for an event to take place, but which are not aaected by the event. They are very useful for describing situations where diierent events share a common resource and want to read it simultaneously. The reason we use contextual nets for cc programs is that 1) nets allow a direct representation of concurrent information and 2) cc programs are naturally context-dependent (since the ask operation is a generalized read). While the causal dependency relation of the net induces a partial order among events in the same computation, its mutual exclusion relation provides a way of expressing nondeterministic information (and thus diierent computations). The information contained in the net, possibly abstracted to have a nite semantics even for recursive programs, can be of great help to a scheduler in order to obtain an eecient execution of the program, or also to a compile-time optimizer.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3. Foundations of Constraint Programming Approaches 3.1 Concurrent Semantics for Concurrent Constraint Programs

A concurrent semantics is a semantics where concurrency can be realistically represented and naturally described. Therefore we believe that every concurrent language should be provided with a formal concurrent semantics. Here we describe three concurrent semantics for concurrent constraint (cc) programs. They are all based on partial order structures relating the various objects involved in the...

متن کامل

Modelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars

Graph grammars (or graph transformation systems), originally introduced as a generalization of string grammars, can be seen as a powerful formalism for the specification of concurrent and distributed systems, which properly extends Petri nets. The idea is that the state of a distributed system can be naturally represented (at a suitable level of abstraction) as a graph and local state transform...

متن کامل

CC Programs with both In- and Non-determinism: A Concurrent Semantics

We present a concurrent semantics for concurrent constraint (cc) programming framework with both (\committed choice") indeterminism and (\backtracking") nondeterminism. The semantics extends the previous semantics for Indeterminate cc by (1) allowing each state to contain di erent or-parallel components and (2) splitting the concurrency relation into two to distinguish between andand or-concurr...

متن کامل

Set-based Error Diagnosis of Concurrent Constraint Programs

We present an automated method for the static prediction of the runtime error`deadlock or failure' in concurrent constraint programs. Operationally, the method is based on a new set-based analysis of reactive logic programs which computes an approximation of the greatest-model semantics. Semantically , the method is based on the connection between the inevitability of`deadlock or failure' in co...

متن کامل

A Causal Semantics for Contextual P/T Nets

The problem of nding a true concurrent semantics for contextual P/T nets has not been deeply studied yet. The interest for such a semantics has been renewed by some recent proposals to equip mobile process algebras with a net semantics based on this model. In this paper we move a step towards the deenition of such a semantics: we rst propose a causal semantics for P/T nets and we prove that thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994